Finding All The Perfect Matchings in Bipartite Graphs
نویسندگان
چکیده
|This paper describes an algorithm for nding all the perfect matchings in a bipartite graph. By using the binary partitioning method, our algorithm requires O(c(n+m) + n 2:5 ) computational e ort and O(nm) memory storage, (where n denotes the number of vertices, m denotes the number of edges, and c denotes the number of perfect matchings in the given bipartite graph). Keywords|bipartite graph, matching, enumeration.
منابع مشابه
Perfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملAlgorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems
A minimal blocker in a bipartite graph G is a minimal set of edges the removal of which leaves no perfect matching in G. We give a polynomial delay algorithm for finding all minimal blockers of a given bipartite graph. Equivalently, this gives a polynomial delay algorithm for listing the anti-vertices of the perfect matching polytope P (G) = {x ∈ R | Hx = e, x ≥ 0}, where H is the incidence mat...
متن کاملSome perfect matchings and perfect half-integral matchings in NC
We show that for any class of bipartite graphs which is closed under edge deletion and where the number of perfect matchings can be counted in NC, there is a deterministic NC algorithm for finding a perfect matching. In particular, a perfect matching can be found in NC for planar bipartite graphs and K3,3-free bipartite graphs via this approach. A crucial ingredient is part of an interior-point...
متن کاملMatchings in Graphs
We know that counting perfect matchings is polynomial time when we restrict ourselves to the class of planar graphs. Generally speaking, the decision and search versions of a problem turn out to be “easier” than the counting question. For example, the problem of determining if a perfect matching exists, and finding one when it does, is polynomial time in general graphs, while the question of co...
متن کاملFinding all minimum-cost perfect matchings in Bipartite graphs
The Hungarian method is an e cient algorithm for nding a minimal cost perfect matching in a weighted bipartite graph. This paper describes an e cient algorithm for nding all minimal cost perfect matchings. The computational time required to generate each additional perfect matching is O(n(n + m)); and it requires O(n+m) memory storage. This problem can be solved by algorithms for nding the Kth-...
متن کامل